Emergence of Wave Patterns on Kadanoff Sandpiles
نویسندگان
چکیده
Emergence is a concept that is easy to exhibit, but very hard to formally handle. This paper is about cubic sand grains moving around on nicely packed columns in one dimension (the physical sandpile is two dimensional, but the support of sand columns is one dimensional). The Kadanoff Sandpile Model is a discrete dynamical system describing the evolution of a finite number of stacked grains —as they would fall from an hourglass— to a stable configuration (fixed point). Grains move according to the repeated application of a simple local rule until reaching a fixed point. The main interest of the model relies in the difficulty of understanding its behavior, despite the simplicity of the rule. In this paper we prove the emergence of wave patterns periodically repeated on fixed points. Remarkably, those regular patterns do not cover the entire fixed point, but eventually emerge from a seemingly highly disordered segment. The proof technique we set up associated arguments of linear algebra and combinatorics, which interestingly allow to formally state the emergence of regular patterns without requiring a precise understanding of the chaotic initial segment’s dynamic.
منابع مشابه
Strong Emergence of Wave Patterns on Kadanoff Sandpiles
Emergence is easy to exhibit, but very hard to formally explain. This paper deals with square sand grains moving around on nicely stacked columns in one dimension (the physical sandpile is two dimensional, but the support of sand columns is one dimensional). The Kadanoff sandpile model is a discrete dynamical system describing the evolution of finitely many sand grains falling from an hourglass...
متن کاملComputational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
In this paper we prove that the general avalanche problem AP is in NC for the Kadanoff sandpile model in one dimension, answering an open problem of [2]. Thus adding one more item to the (slowly) growing list of dimension sensitive problems since in higher dimensions the problem is P-complete (for monotone sandpiles).
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-compl...
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-c...
متن کاملBehavior of coupled automata.
We study the nature of statistical correlations that develop between systems of interacting self-organized critical automata (sandpiles). Numerical and analytical findings are presented describing the emergence of "synchronization" between sandpiles and the dependency of this synchronization on factors such as variations in coupling strength, toppling rule probabilities, symmetric versus asymme...
متن کامل